On dominating set polyhedra of circular interval graphs
نویسندگان
چکیده
Clique-node and closed neighborhood matrices of circular interval graphs are matrices. The stable set polytope the dominating on these therefore closely related to packing covering polyhedron Eisenbrand et al. (2008) take advantage this relationship propose a complete linear description graphs. In paper we follow similar ideas obtain same class As in case, our results established for larger polyhedra form Q?(A,b)?convx?Z+n:Ax?b, with A matrix b an integer vector. These also provide descriptions associated several variants problem
منابع مشابه
The Dominating Set Problem on Shiftable Interval Graphs
In this paper the problem of computing a minimum dominating set of a Shiftable Interval Graph (SIG) is studied. SIG's can be considered a generalization of interval graphs, in the sense that a SIG identifies a whole family of interval graphs. An optimization problem defined on a SIG consists in determining an interval graph of the family which optimizes the value of the chosen measure. In this ...
متن کاملDominating Set on Bipartite Graphs
Finding a dominating set of minimum cardinality is an NP-hard graph problem, even when the graph is bipartite. In this paper we are interested in solving the problem on graphs having a large independent set. Given a graph G with an independent set of size z, we show that the problem can be solved in time O∗(2n−z), where n is the number of vertices of G. As a consequence, our algorithm is able t...
متن کاملCapacitated Dominating Set on Planar Graphs
Capacitated Domination generalizes the classic Dominating Set problem by specifying for each vertex a required demand and an available capacity for covering demand in its closed neighborhood. The objective is to find a minimum-sized set of vertices that can cover all of the graph’s demand without exceeding any of the capacities. In this paper we look specifically at domination with hard-capacit...
متن کاملIncidence dominating numbers of graphs
In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.
متن کاملColoring Fuzzy Circular Interval Graphs
Given a graph G with nonnegative node labels w, a multiset of stable sets S1, . . . , Sk ⊆ V (G) such that each vertex v ∈ V (G) is contained in w(v) many of these stable sets is called a weighted coloring. The weighted coloring number χw(G) is the smallest k such that there exist stable sets as above. We provide a polynomial time combinatorial algorithm that computes the weighted coloring numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2020.112283